Click any tag below to further narrow down your results
Links
Google Quantum AI ran a series of tests on its superconducting chips showing that quantum systems can't be assigned fixed answers in advance, and that this property can be measured and used for computation. The team reports results from up to 105 qubits, and argues the same tests can serve as a benchmark for hardware errors.
- On a 3×3 "magic square" game, the qubits won 98.30% of rounds, beating the 88.89% ceiling any pre-written classical strategy can reach.
- A Bell–Kochen–Specker style test gave χ = 5.590 ± 0.008, above the classical limit of 4 and near the quantum maximum of 6.
- Shallow quantum circuits solved hidden-linear-function problems on grids up to 105 qubits, and the same tasks exposed subtle coherent errors that random-circuit benchmarks miss.
Cryptographers from Stanford and a16z address whether recent AI breakthroughs threaten the math underpinning encryption. The short answer: recent AI progress on general math problems tells us almost nothing about cryptographic security, and even smarter AI can't solve problems that don't have efficient solutions.
- Recent AI math breakthroughs didn't include any cryptography results, so they reveal nothing about whether encryption methods are actually vulnerable.
- Modern cryptography assumes certain math problems have no efficient algorithm at all—not just that humans haven't found one yet. A smarter AI can't discover an algorithm that doesn't exist.
- AI could compress the years-long vetting process for new cryptographic systems by rapidly testing whether they can be broken, building confidence faster than traditional analysis.
- Cryptographic agility—the ability to switch between different encryption methods—already exists in systems like TLS and offers defense against both AI and quantum threats.
Google’s recent paper reveals that Shor’s algorithm can potentially break the cryptography used by Bitcoin and Ethereum with fewer than 500,000 qubits. The paper discloses significant architectural details, suggesting that reproducing similar circuits is feasible for well-resourced quantum research teams. However, the actual hardware needed for an attack remains a substantial barrier.
- Google's paper shows Shor's algorithm could break Bitcoin/Ethereum's 256-bit ECC with under 500,000 physical qubits in about nine minutes—roughly Bitcoin's block time.
- Even though Google withheld exact circuit details, the disclosed architecture (kickmix design, modular inversion, ~2.7 million non-Clifford gates per point addition) gives skilled teams enough to replicate similar circuits within months.
- Goertzel estimates a small expert team could reproduce circuits within 2-3x Google's efficiency in 6-12 months, and even a 2x-worse circuit would still threaten current cryptography.
- The real barrier isn't algorithmic knowledge but building the actual hardware, though well-funded labs or defense contractors could plausibly pursue it.